Truncated normal forms for solving polynomial systems
نویسندگان
چکیده
منابع مشابه
Stable normal forms for polynomial system solving
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal I . The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending the one provided in [29]. This general border basis algorithm weakens the monomial ordering requirement for Gröbner bases computations. It is up to date the ...
متن کاملPolynomial and Linearized Normal Forms for Almost Periodic Differential Systems
For almost periodic differential systems ẋ = εf(x, t, ε) with x ∈ Cn, t ∈ R and ε > 0 small enough, we get a polynomial normal form in a neighborhood of a hyperbolic singular point of the system ẋ = ε limT→∞ 1 T ∫ T 0 f(x, t, 0) dt, if its eigenvalues are in the Poincaré domain. The normal form linearizes if the real part of the eigenvalues are non–resonant.
متن کاملNormal forms for general polynomial matrices
We present an algorithm for the computation of a shifted Popov Normal Form of a rectangular polynomial matrix. For specific input shifts, we obtain methods for computing the matrix greatest common divisor of two matrix polynomials (in normal form) or such polynomial normal form computation as the classical Popov form and the Hermite Normal Form. The method is done by embedding the problem of co...
متن کاملSolving Systems of Polynomial
Current geometric and solid modeling systems use semi-algebraic sets for deening the boundaries of solid objects, curves and surfaces, geometric constraints with mating relationship in a mechanical assembly, physical contacts between objects, collision detection. It turns out that performing many of the geometric operations on the solid boundaries or interacting with geometric constraints is re...
متن کاملSolving parametric polynomial systems
We present a new algorithm for solving basic parametric constructible or semi-algebraic systems like C = {x ∈ C, p1(x) = 0, , ps(x) = 0, f1(x) 0, , fl(x) 0} or S = {x ∈ R, p1(x) = 0, , ps(x) = 0, f1(x)> 0, , fl(x)> 0}, where pi, fi ∈Q[U , X], U = [U1, , Ud] is the set of parameters and X = [Xd+1, , Xn] the set of unknowns. If ΠU denotes the canonical projection onto the parameter’s space, solvi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Communications in Computer Algebra
سال: 2019
ISSN: 1932-2240
DOI: 10.1145/3313880.3313888